翻訳と辞書 Words near each other ・ Joint Combat Pistol ・ Joint Combined Exchange Training ・ Joint Command and Staff College ・ Joint Command of the Armed Forces of Peru ・ Joigny-sur-Meuse ・ Joik ・ Join ・ Join (sigma algebra) ・ Join (SQL) ・ Join (topology) ・ Join (Unix) ・ Join and meet ・ Join Australia Movement Party ・ Join Bing and Sing Along ・ Join Dan Sartain ・ Join dependency ・ Join Five ・ Join Hands ・ Join In! ・ Join Inn ・ Join Java ・ Join Jim Dale ・ Join Me ・ Join Me in Death ・ Join My Cult ・ Join Network Studio of NENU ・ Join Our Club ・ Join point ・ Join selection factor ・ Join the Army Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Join dependency ： ウィキペディア英語版 Join dependency In the area of computer science known as dependency theory, a join dependency is a constraint on the set of legal relations over a database scheme. A table T is subject to a join dependency if T can always be recreated by joining multiple tables each having a subset of the attributes of T. If one of the tables in the join has all the attributes of the table T, the join dependency is called trivial. The join dependency plays an important role in the Fifth normal form, also known as ''project-join normal form'', because it can be proven that if you decompose a scheme $R$ in tables $R\_1$ to $R\_n$, the decomposition will be a lossless-join decomposition if you restrict the legal relations on $R$ to a join dependency on $R$ called $$ *(R_1,R_2,\ldots,R_n). Another way to describe a join dependency is to say that the set of relationships in the join dependency is independent of each other. Unlike in the case of functional dependencies, there is no sound and complete axiomatization for join dependencies, though axiomatization exist for more expressive dependency languages such as full typed dependencies. However, implication of join dependencies is decidable.〔 == Formal definition == 2-ary join dependencies are called multivalued dependency as a historical artifact of the fact that they were studied before the general case. More specifically if ''U'' is a set of attributes and ''R'' a relation over it, then ''R'' satisfies $X\; \backslash twoheadrightarrow\; Y$ if and only if ''R'' satisfies $$ *(X\cup Y, X\cup(U-Y)). 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Join dependency」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.